Square lattice self-avoiding walks and biased differential approximants

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of self-avoiding walks on the square lattice

We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71. Series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and mean-square distance of monomers from the end points h...

متن کامل

Square lattice walks avoiding a quadrant

In the past decade, a lot of attention has been devoted to the enumeration of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear transformation). But what about walks in non-convex cones? We investigate the two most natural cases: first, square lattice walks avoiding the negative quadran...

متن کامل

Ballistic behavior for biased self-avoiding walks

For self-avoiding walks on the d-dimensional cubic lattice defined with a positive bias in one of the coordinate directions, it is proved that the drift in the favored direction is strictly positive. c © 2008 Elsevier B.V. All rights reserved. Keyword: Biased self-avoiding walks

متن کامل

Self-avoiding walks crossing a square

We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at (L,L), and are entirely contained in the square [0, L]× [0, L] on the square lattice Z. The number of distinct walks is known to grow as λ 2+o(L2). We estimate λ = 1.744550± 0.000005 as well as obtaining strict upper and lower bounds, 1.628 < λ < 1.782. We give exact results for the number of SAW o...

متن کامل

Self-avoiding random walks on lattice strips.

A self-avoiding walk on an infinitely long lattice strip of finite width will asymptotically exhibit an end-to-end separation proportional to the number of steps. A proof of this proposition is presented together with comments concerning an earlier attempt to deal with the matter. In addition, some unproved, yet "obvious," conjectures concerning self-avoiding walks are cited as basic propositio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical

سال: 2016

ISSN: 1751-8113,1751-8121

DOI: 10.1088/1751-8113/49/42/424003